Using Monodromy to Decompose Solution Sets of Polynomial Systems into Irreducible Components
نویسندگان
چکیده
To decompose solution sets of polynomial systems into irreducible components, homotopy continuation methods generate the action of a natural monodromy group which partially classi es generic points onto their respective irreducible components. As illustrated by the performance on several test examples, this new method achieves a great increase in speed and accuracy, as well as improved numerical conditioning of the multivariate interpolation problem. 2000 Mathematics Subject Classi cation. Primary 65H10; Secondary 13P05, 14Q99, 68W30.
منابع مشابه
Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
Many polynomial systems have solution sets comprised of multiple irreducible components, possibly of different dimensions. A fundamental problem of numerical algebraic geometry is to decompose such a solution set, using floating-point numerical processes, into its components. Prior work has shown how to generate sets of generic points guaranteed to include points from every component. Furthermo...
متن کاملDecomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible components. The computation of a linear trace for each factor certifies the decomposition. This factorization method exhibits a good practical performance o...
متن کاملA Method for Tracking Singular Paths with Application to the Numerical Irreducible Decomposition
In the numerical treatment of solution sets of polynomial systems, methods for sampling and tracking a path on a solution component are fundamental. For example, in the numerical irreducible decomposition of a solution set for a polynomial system, one first obtains a “witness point set” containing generic points on all the irreducible components and then these points are grouped via numerical e...
متن کاملIntroduction to Numerical Algebraic Geometry
In a 1996 paper, Andrew Sommese and Charles Wampler began developing a new area, “Numerical Algebraic Geometry”, which would bear the same relation to “Algebraic Geometry” that “Numerical Linear Algebra” bears to “Linear Algebra”. To approximate all isolated solutions of polynomial systems, numerical path following techniques have been proven reliable and efficient during the past two decades. ...
متن کاملNumerical Local Irreducible Decomposition
Globally, the solution set of a system of polynomial equations with complex coefficients can be decomposed into irreducible components. Using numerical algebraic geometry, each irreducible component is represented using a witness set thereby yielding a numerical irreducible decomposition of the solution set. Locally, the irreducible decomposition can be refined to produce a local irreducible de...
متن کامل